#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

int main() {
    std::string s;
    std::getline(std::cin, s);
    std::vector<std::string> l;
    std::string word;
    for (char c : s) {
        if (c == ' ') {
            l.push_back(word);
            word.clear();
        } else {
            word += c;
        }
    }
    l.push_back(word);

    std::vector<std::string> Z = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
    std::vector<int> RZ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    std::vector<int> PR = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};

    if (l.size() == 3) {
        if (std::find(Z.begin(), Z.end(), l[0]) != Z.end() && std::find(Z.begin(), Z.end(), l[1]) != Z.end() && std::find(Z.begin(), Z.end(), l[2]) != Z.end() && l[0] != "zero") {
            int C1 = std::find(Z.begin(), Z.end(), l[0]) - Z.begin();
            int C2 = std::find(Z.begin(), Z.end(), l[1]) - Z.begin();
            int C3 = std::find(Z.begin(), Z.end(), l[2]) - Z.begin();
            int C1R = RZ[C1];
            int C2R = RZ[C2];
            int C3R = RZ[C3];
            int Z = C1R * 100 + C2R * 10 + C3R;
            auto closest = [&PR, Z](){ return *std::min_element(PR.begin(), PR.end(), [Z](int a, int b){ return std::abs(a - Z) < std::abs(b - Z); }); };
            std::cout << closest() << std::endl;
        } else {
            std::cout << "Wrong input" << std::endl;
        }
    } else {
        std::cout << "Wrong input" << std::endl;
    }

    return 0;
}
